A Preprocessing Algorithm to Implement Greedy-MRS for Selecting a Hierarchical Reliable Multicast Proxy

Many hierarchical reliable multicast (HRM) protocols deploy repair proxies that perform local recovery and feedback consolidation. Placement of proxies is a key design issue in HRM network. The objective of Greedy-MRS algorithm is to place the HRM proxy in a single iteration, but it requires communication with routers frequently to find the efficient proxy. The objective of preprocessing step is to communicate with routers to implement Greedy– MRS algorithm with minimum number of communications between routers. Space needed in the router to store data to find efficient placement of proxies for HRM network is constant and it is independent of number of children. Simulation results indicate that this preprocessing step providing good levels of space and communication complexity and scalability of this algorithm depends on height of subtree.